|
|
Cache-oblivious Algorithms
Vaner, Michal ; Mareš, Martin (advisor) ; Falt, Zbyněk (referee)
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of the memory hierarchy of current computers. We study several graph algorithms and techniques of their design in this model. We consider graph searching, identifying connected components and computing maximal matching. We also study sorting and matrix multiplication as subproblems of many graph algorithms. In ad- dition to previously known algorithms, we present several new ones. We study their efficiency both by the means of asymptotic complexity and by benchmarking them on real hardware and we compare them with classical algorithms.
|
|
|
Potravinářské výrobky jako faktor vnímání Evropské unie v České republice
ŽIDOŇ, Zdeněk
Foodstuffs are often discussed in the Czech Republic in relation to the European Union. In the past, European regulations which affected traditional Czech food products caused big controversies. Currently, the most discussed issue in this context is a dual quality of food products placed on the European single market. The introductory part of this thesis deals with a development of this issue in the institutions of the European Union and includes the opinions of Czech Members of the European Parliament. This thesis also analyses related European legislature and proposed solutions regarding dual quality, summaries relevant Czech, Slovak and other foreign comparative tests of products and assesses the most common arguments which the producers use to defend the differences in the composition of their products. The final part of the thesis puts the habits of Czech consumers in contrast with neighbouring countries and, based on available data regarding the opinions about the EU, formulates a theory which answers the question of how dual quality of products influences the perception of the European Union in the Czech Republic.
|
|
|
Cache-oblivious Algorithms
Vaner, Michal ; Mareš, Martin (advisor) ; Falt, Zbyněk (referee)
In this work, we study the cache-oblivious computation model, which is inspired by the behaviour of the memory hierarchy of current computers. We study several graph algorithms and techniques of their design in this model. We consider graph searching, identifying connected components and computing maximal matching. We also study sorting and matrix multiplication as subproblems of many graph algorithms. In ad- dition to previously known algorithms, we present several new ones. We study their efficiency both by the means of asymptotic complexity and by benchmarking them on real hardware and we compare them with classical algorithms.
|
guest ::
